In Search of Computational Correlates of Artificial Qualia
نویسندگان
چکیده
In previous papers we presented a robot cognitive architecture organized in three computational areas. The subconceptual area is concerned with the processing of data coming from the sensors. In the linguistic area representation and processing are based on a logic-oriented formalism. The conceptual area is intermediate between the subconceptual and the linguistic areas and it is based on the notion of conceptual spaces. The robot, starting from the 3D information stored in the conceptual area and from the data coming form sensors and processed by the subconceptual area, is able to build a 2D viewer dependent reconstruction of the scene it is perceiving. This 2D model corresponds to what the robot is seeing at any given time. We suggest that the conceptual and the linguistic areas are at the basis of the robot artificial qualia.
منابع مشابه
Automatically Learning Qualia Structures From The Web
Qualia Structures have many applications within computational linguistics, but currently there are no corresponding lexical resources such as WordNet or FrameNet. This paper presents an approach to automatically learn qualia structures for nominals from the World Wide Web and thus opens the possibility to explore the impact of qualia structures for natural language processing at a larger scale....
متن کاملOPTIMUM DESIGN OF DOUBLE CURVATURE ARCH DAMS USING A QUICK HYBRID CHARGED SYSTEM SEARCH ALGORITHM
This paper presents an efficient optimization procedure to find the optimal shapes of double curvature arch dams considering fluid–structure interaction subject to earthquake loading. The optimization is carried out using a combination of the magnetic charged system search, big bang-big crunch algorithm and artificial neural network methods. Performing the finite element analysis dur...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملAutomatic Acquisition of Ranked Qualia Structures from the Web
This paper presents an approach for the automatic acquisition of qualia structures for nouns from the Web and thus opens the possibility to explore the impact of qualia structures for natural language processing at a larger scale. The approach builds on earlier work based on the idea of matching specific lexico-syntactic patterns conveying a certain semantic relation on the World Wide Web using...
متن کامل